Compositional Verification of Timed Components using PVS
نویسندگان
چکیده
We present a general framework to support the compositional verification of timed systems using the interactive theorem prover PVS. The framework is based on timed traces that are an abstraction of the timed semantics of flat UML state machines. We define a compositional proof rule for parallel composition and prove its soundness in PVS. After composition, a hiding rule can be applied to hide internal events. The general theories have been applied to parts of the Medium Altitude Reconnaissance System (MARS) as deployed in the F-16 aircraft of the Royal Netherlands Air-Force.
منابع مشابه
Towards Integrated Verification of Timed Transition Models
This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling Environment (TAME) has been modified to provide a formal model for Time Transition Models (TTMs) in the PVS proof checker. Strong and weak state-event observation equivalences are formalized in PVS for state-event labeled tran...
متن کاملCompositional Verification of Timed Systems
In this paper we address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations betw...
متن کاملModeling Timed Automata Theory in PVS
A mechanized system called FVofTA (Formal Verification of Timed Automata) for specifying and reasoning about real-time systems using TA (Timed Automata) theory in PVS (Prototype Verification System) is proposed in this paper. This system includes two parts: one for modeling real-time system using TA template in PVS and the other for proof intending for formal verification of real-times system. ...
متن کاملCompositional Verification of Real-Time Applications
To support top-down design of distributed real-time systems, a framework of mixed terms has been incorporated in the veriication system PVS. Programs and assertional speciications are treated in a uniform way. We focus on the timed behaviour of parallel composition and hiding, presenting several alternatives for the deenition of a deno-tational semantics. This forms the basis of compositional p...
متن کاملCompositional Verification for Timed Systems Based on Automatic Invariant Generation
We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints...
متن کامل